Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
نویسندگان
چکیده
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a decomposition with less than k DPS ?) is NP-complete, and thus that the optimisation problem (finding the minimal number of DPS) is NP-hard. The proof is based on a polynomial reduction of any instance of the well-known 3-SAT problem to an instance of the digital surface decomposition problem. A geometric model for the 3-SAT problem is proposed.
منابع مشابه
Minimum decomposition of a digital surface into digital plane segments is NP-hard
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a decomposition with less than λ DPS ?) is NP-complete, and thus that the optimisation problem (finding the minimum number of DPS) is NP-hard. The proof is based on a polynomial reduction of any instance of the well-know...
متن کاملDigital cohomology groups of certain minimal surfaces
In this study, we compute simplicial cohomology groups with different coefficients of a connected sum of certain minimal simple surfaces by using the universal coefficient theorem for cohomology groups. The method used in this paper is a different way to compute digital cohomology groups of minimal simple surfaces. We also prove some theorems related to degree properties of a map on digital sph...
متن کاملComparison of Accuracy and Observer Agreement in the Detection of Simulated External Root Resorption Using Conventional Digital Radiography and Digitally Filtered Radiography
Introduction: External root resorption is a clinical problem that often cannot be detected clinically. Thus, radiography plays a crucial role in its diagnosis. However, optimal radiographic quality with minimal radiation exposure {2.1 [EN] Verify English word/phrase choice} is an important factor in selecting the appropriate radiographic technique. The aim of this study was the comparison of ac...
متن کاملReversible vectorisation of 3D digital planar curves and applications
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal curve. The proposed transformation also provides an analytical modelling of a digital plane segment as a discrete polygon composed of a face, edges and vertices. A dual space representation of lines and planes is used t...
متن کاملA FILTERED B-SPLINE MODEL OF SCANNED DIGITAL IMAGES
We present an approach for modeling and filtering digitally scanned images. The digital contour of an image is segmented to identify the linear segments, the nonlinear segments and critical corners. The nonlinear segments are modeled by B-splines. To remove the contour noise, we propose a weighted least q m s model to account for both the fitness of the splines as well as their approximate cur...
متن کامل